On complete one-way functions
نویسندگان
چکیده
Complete constructions play an important role in theoretical computer science. However, in cryptography complete constructions have so far been either absent or purely theoretical. In 2003, L.A. Levin presented the idea of a combinatorial complete one-way function. In this paper, we present two new one-way functions based on semi-Thue string rewriting systems and a version of the Post correspondence problem. We also present the properties of a combinatorial problem that allow a complete one-way function to be based on this problem. The paper also gives an alternative proof of Levin’s result. DOI: 10.1134/S0032946009020082
منابع مشابه
1342 - 2812 One - Way Functions and the Isomorphism Conjecture
We study the Isomorphism Conjecture proposed by Berman and Hartmanis. It states that all sets complete for NP under polynomial-time many-one reductions are P-isomorphic to each other. From previous research it has been widely believed that all NP-complete sets are reducible each other by one-to-one and length-increasing polynomial-time reductions, but we may not hope for the full p-isomorphism ...
متن کاملOn Constructing Universal One-Way Hash Functions from Arbitrary One-Way Functions
A fundamental result in cryptography is that a digital signature scheme can be constructed from an arbitrary one-way function. A proof of this somewhat surprising statement follows from two results: first, Naor and Yung defined the notion of universal one-way hash functions and showed that the existence of such hash functions implies the existence of secure digital signature schemes. Subsequent...
متن کاملFixed Point Theorems on Complete Quasi Metric Spaces Via C-class and A-Class Functions
In this paper, we present some fixed point theorems for single valued mappings on $K$-complete, $M$-complete and Symth complete quasi metric spaces. Here, for contractive condition, we consider some altering distance functions together with functions belonging to $C$-class and $A$-class. At the same time, we will consider two different type $M$ functions in contractive conditions because the qu...
متن کاملNew Combinatorial Complete One-Way Functions
In 2003, Leonid A. Levin presented the idea of a combinatorial complete one-way function and a sketch of the proof that Tiling represents such a function. In this paper, we present two new one-way functions based on semi-Thue string rewriting systems and a version of the Post Correspondence Problem and prove their completeness. Besides, we present an alternative proof of Levin’s result. We also...
متن کاملSemigroups and one-way functions
We study the complexity classes P and NP through a semigroup fP (“polynomial-time functions”), consisting of all polynomially balanced polynomial-time computable partial functions. Then P 6= NP iff fP is a non-regular semigroup. The one-way functions considered here are based on worstcase complexity (they are not cryptographic); they are the non-regular elements of fP. We prove various properti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Probl. Inf. Transm.
دوره 45 شماره
صفحات -
تاریخ انتشار 2009